<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="utf-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1">
    <META NAME="ROBOTS" CONTENT="NOINDEX, NOFOLLOW">
    <link rel="icon" href="../images/logo/logo.png" type="image/x-icon">
    <link rel="shortcut icon" href="../images/logo/logo.png"
          type="image/x-icon">
    <title>浏阳德塔软件开发有限公司 女娲计划</title>
</head>
<body style="Max-width: 700px; text-align:center; margin:auto;">
<div style="text-align:left; Max-width: 680px; margin-left:15px;">
    <a href="../">上一页</a>
    <br/>
    <br/>
    <br/>第六章_数据预测引擎系统
    <br/> 作者: 罗瑶光, Author:Yaoguang.Luo<br/>
    <br/>
    <br/>基础应用: 元基催化与肽计算 编译机的进制仿生计算机
    <br/>

    极速高阶欧拉融聚商旅团TSP路径算法的思维来源 <br/>
    <br/>
    作者最早接触轨迹路径算法, 来自高中玩帝国时代, 红色警戒和星际争霸游戏, 里面鼠标右键点击
    自动生成行军路径很酷炫, 作者的完整欧拉理论基础来自印度基督大学维嘉神父教授的离散数学
    第六版紫皮书. (当时胡春牛带了本中文的离散数学简化版书来了印度, 记得有欧拉图论的中文,
    方便了作者的阅读). 作者第一次听到商旅算法 这个词汇来自亚米Little的口中, 当时一行人出去
    寻觅圣盖博下馆子, Little说研究商旅算法的都很牛. 而作者第一次看到问题, 是作者在走四方
    一天晚上加班翻译php那个黄项目的时候, 国内来了个梁总, 莫名在作者旁边起高腔和余总争论一些琐事
    , 突然把我叫过去说旅行算法计算太慢, 问我怎么解决, 我当时比较懵, 余总说这是国内团队设计的,
    不是作者的事. 后作者面试和求职英特尔前, 打发时间, 开始刷lee-code, code rank等, 就把23~49
    个坐标的商旅TSP给 计算了. 后来就逐步优化. 当作者的切裂算法问世了时候, 突然想到, 如果将切裂
    开的坐标进行密集度融聚, 这时候融聚的坐标就是微分小欧拉, 上层就是大欧拉, 于是这个模型图便
    诞生了. 作者分享一个今天才揭开的秘密给大家: 切裂的词汇来自作者2012年玩苹果ios游戏
    索罗门法师(Solomon Boneyard), 里面的跟踪魔法弹叫 fissile 哈哈. 罗瑶光 <br/>
    <br/>
    A Time Locus of Speed Fissile TSP about Euler Forest <br/>
    <br/>
    The author did a sixth foundation of Discrete Mathematics in a college
    time by following Father of Christ, Dr. Joseph Varghese. Before Mr.
    Yaoguang went to Folsom Intel, he had finished a simple Euler TSP
    Algorithm to deal with the coordinates which amount less than 23
    coords, then made an optimization which promoted to 49 coords. Once the
    Deta Fissile Algorithm had built, the author thought that made a
    separation of those coordinates by a long distance firstly, then did a
    Deta Fusional Algorithm by a short distance, and then made an Euler TSP
    connection based on short distance, and finally made an Euler TSP
    connection based on long distance. It seems like a Euler Forest, and
    the inner short TSP distance groups such as tree clusters. <br/>
    <br/>
    Author YaoguangLuo 稍后优化 <br/>
    <br/>
    4 作者研究结果为十六元基进制 破解 DCPE-THOS-MAXF-VIUQ. refer page 下册5, 下册56, 下册125
    <br/>
    <br/>

</div>
</body>